The face pair of planar graphsYANG YUANSHENG; LIN XIAOHUI; QIAO JING et al.Discrete mathematics. 2006, Vol 306, Num 15, pp 1742-1757, issn 0012-365X, 16 p.Article

Eigenvalues and edge-connectivity of regular graphsCIOABA, Sebastian M.Linear algebra and its applications. 2010, Vol 432, Num 1, pp 458-470, issn 0024-3795, 13 p.Article

A class of amply regular graphs related to the subconstituents of a dual polar graphLI, Feng-Gao; WANG, Yang-Xian.Discrete mathematics. 2006, Vol 306, Num 22, pp 2909-2915, issn 0012-365X, 7 p.Article

Factorizations of regular graphs of high degreeHILTON, A. J. W.Journal of graph theory. 1986, Vol 9, Num 1, pp 193-196, issn 0364-9024Article

Regular graphs of high degree are 1-factorizableCHETWYND, A. G; HILTON, A. J. W.Proceedings of the London Mathematical Society. 1985, Vol 50, Num 2, pp 193-206, issn 0024-6115Article

Some new two-weight codes and strongly regular graphsBROUWER, A. E.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 111-114, issn 0166-218XArticle

On a problem of A. Kotzig concerning factorizations of 4-regular graphsZELINKA, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 325-330, issn 0364-9024Article

On smallest regular graphs with a given isopartFINK, J. F.Journal of graph theory. 1985, Vol 9, Num 1, pp 105-117, issn 0364-9024Article

The uniqueness of the strongly regular graph on 77 pointsBROUWER, A. E.Journal of graph theory. 1983, Vol 7, Num 4, pp 455-461, issn 0364-9024Article

Maximum Matching in Regular and Almost Regular GraphsYUSTER, Raphael.Algorithmica. 2013, Vol 66, Num 1, pp 87-92, issn 0178-4617, 6 p.Article

Strongly regular graphs with non-trivial automorphismsBEHBAHANI, Majid; LAM, Clement.Discrete mathematics. 2011, Vol 311, Num 2-3, pp 132-144, issn 0012-365X, 13 p.Article

A note on a conjecture on maximum matching in almost regular graphsPICOULEAU, C.Discrete mathematics. 2010, Vol 310, Num 24, pp 3646-3647, issn 0012-365X, 2 p.Article

Designs on the webBAILEY, R. A; CAMERON, Peter J; DOBCSANYI, Peter et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3014-3027, issn 0012-365X, 14 p.Conference Paper

Efficient testing of hypergraphs: (Extended abstract)KOHAYAKAWA, Yoshiharu; NAGLE, Brendan; RÖDL, Vojtech et al.Lecture notes in computer science. 2002, pp 1017-1028, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Factors in a class of regular digraphsRAMANATH, M. V. S.Journal of graph theory. 1985, Vol 9, Num 1, pp 161-175, issn 0364-9024Article

Hamiltonian cycles in random regular graphsFENNER, T. I; FRIEZE, A. M.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 2, pp 103-112, issn 0095-8956Article

Regular digraphs containing: a given digraphHARARY, F; KARABED, R.Canadian mathematical bulletin. 1984, Vol 27, Num 2, pp 129-133, issn 0008-4395Article

The graphs G(n, k) of the Johnson schemes are unique for n≥20MOON, A.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 2, pp 173-188, issn 0095-8956Article

Universal traversal sequences of length nθ(^LOGn) for cliquesKARLOFF, H. J; RAMAMOHAN PATURI; SIMON, J et al.Information processing letters. 1988, Vol 28, Num 9, pp 241-243, issn 0020-0190Article

A note on the interval number of a graphERDOS, P; WEST, D. B.Discrete mathematics. 1985, Vol 55, Num 2, pp 129-133, issn 0012-365XArticle

Distance-regular graphs with girth 3 or 4:1TERWILLIGER, P.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 265-281, issn 0095-8956Article

Partitioning strongly regular graphsNODA, R.Osaka Journal of Mathematics. 1985, Vol 22, Num 2, pp 379-389, issn 0030-6126Article

Regular factors of regular graphsBOLLOBAS, B; SAITO, A; WORMALD, N. C et al.Journal of graph theory. 1985, Vol 9, Num 1, pp 97-103, issn 0364-9024Article

Regular subgraphs of dense graphsPYBER, L.Combinatorica (Print). 1985, Vol 5, Num 4, pp 347-349, issn 0209-9683Article

A distribution invariant for association schemes and strongly regular graphsBIER, T.Linear algebra and its applications. 1984, Vol 57, pp 105-113, issn 0024-3795Article